منابع مشابه
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which are hard to investigate directly on natural languages. One question that has not been sufficiently addressed in the literature is to what extent can a result proved on an abstract model be presumed to hold for the co...
متن کاملQuantitative Generalizations of Languages
In the traditional view, a language is a set of words, i.e., a function from words to boolean values. We call this view “qualitative,” because each word either belongs to or does not belong to a language. Let Σ be an alphabet, and let us consider infinite words over Σ. Formally, a qualitative language over Σ is a function A: Σ → B. There are many applications of qualitative languages. For examp...
متن کاملQuantitative Tone and Intonation Modeling across Languages
Although it has been shown for many languages that the Fujisaki model is in principle capable of decomposing F0 contours in these languages, problems remain as to the automatic extraction as well as the interpretation of parameters extracted with respect to their phonological relevance. The claim is made in the current article that the Fujisaki model parametrization used must be rooted in the l...
متن کاملOn Some Quantitative Aspects of Formal Languages
Thèse dirigée par Oded Maler. Soutenue le 21 octobre 2009 devant la commission d'examen.
متن کاملQuantitative Languages Defined by Functional Automata
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2010
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1805950.1805953